Streamable Fragments of Forward XPath
نویسندگان
چکیده
We present a query answering algorithm for a fragment of Forward XPath on Xml streams that we obtain by compilation to deterministic nested word automata. Our algorithm is earliest and in polynomial time. This proves the finite streamability of the fragment of Forward XPath with child steps, outermost-descendant steps, label tests, negation, and conjunction (aka filters), under the reasonable assumption that the number of conjunctions is bounded. We also prove that finite streamability fails without this assumption except if P=NP.
منابع مشابه
Queries on Xml streams with bounded delay and concurrency
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query are two measures for the degree of their streamability. They count the maximal number of stream elements during the life time for some query answer, and respectively, the maximal number of simultaneously alive answer can...
متن کاملTowards a Streamed XPath Evaluation
XPath is a language for addressing fragments of XML documents, used in query and transformation languages such as XQuery and XSLT. For many applications it is desirable to process XPath on the fly and progressively against data streams. This diploma thesis is devoted to streamed and progressive evaluation of XPath. A streamed and progressive XPath evaluation considerably reduces the needed memo...
متن کاملSatisfiability of Simple XPath Fragments under Duplicate-Free DTDs
In this paper, we consider the XPath satisfiability problem under restricted DTDs called “duplicate free”. For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Evaluating an unsatisfiable XPath expression is meaningless, since such an expression can always be replaced by an emp...
متن کاملSatisfiability of Simple XPath Fragments under Fixed DTDs
The XPath satisfiability problem is to decide, for an XPath expression q and a DTD D, if there exists an XML document t valid against D such that the answer of q on t is nonempty. It is shown that the satisfiability problem is intractable for many XPath fragments. In this paper, we focus on fixed DTDs and consider the problem under fixed DTDs. We first show that, for a very restricted XPath fra...
متن کاملContainment for XPath Fragments under DTD Constraints
The containment and equivalence problems for various fragments of XPath have been studied by a number of authors. For some fragments , deciding containment (and even minimisation) has been shown to be in ptime, while for minor extensions containment has been shown to be conp-complete. When containment is with respect to trees satisfying a set of constraints (such as a schema or DTD), the proble...
متن کامل